Proxy Re-encryption Scheme based on New Multivariate Quadratic Assumptions
نویسندگان
چکیده
In PKC 2012, a public key encryption based on new multivariate quadratic assumptions is proposed. The compactness and security of the algorithm illumined us in applying it in proxy re-encryption scheme. In this paper, a novel unidirectional PRE scheme (NMQ-PRE) is constructed based on new multivariate quadratic assumptions. The new scheme is a formal PRE scheme and compact in cryptographic protocols. By applying the nature property of multivariate quadratic assumptions, NMQ-PRE is proved chosen ciphertext attack in standard model. Compared with the traditional PRE scheme based on RSA or pairings, NMQ-PRE is computationally efficient and simpler. Finally, a NMQ-PRE scheme for message block is built for application convenience, such as file sharing or mail forwarding.
منابع مشابه
Lattice Based Identity Based Proxy Re-Encryption Scheme
At Eurocrypt 1998, Blaze, Bleumer and Strauss (BBS) presented a new primitive called proxy reencryption. This new primitive allows semi trusted proxy to convert a ciphertext for Alice into a ciphertext for Bob without underlying message. Till now all the identity based proxy re-encryption schemes are based on the number theoretic assumptions like prime factorization, discrete logarithm problem ...
متن کاملProxy Re-Encryption and Re-Signatures from Lattices
Proxy re-encryption (PRE) and Proxy re-signature (PRS) were introduced by Blaze, Bleumer and Strauss [Eurocrypt ’98]. Basically, PRE allows a semi-trusted proxy to transform a ciphertext encrypted under one key into an encryption of the same plaintext under another key, without revealing the underlying plaintext. Since then, many interesting applications have been explored, and many constructio...
متن کاملVarious Proxy Re-Encryption Schemes from Lattices
Proxy re-encryption (PRE) was introduced by Blaze, Bleumer and Strauss [Eurocrypt ’98]. Basically, PRE allows a semi-trusted proxy to transform a ciphertext encrypted under one key into an encryption of the same plaintext under another key, without revealing the underlying plaintext. Since then, many interesting applications have been explored, and many constructions in various settings have be...
متن کاملFully-Anonymous Functional Proxy-Re-Encryption
In this paper, we introduce a general notion of functional proxy-re-encryption (F-PRE), where a wide class of functional encryption (FE) is combined with proxy-re-encryption (PRE) mechanism. The PRE encryption system should reveal minimal information to a proxy, in particular, hiding parameters of re-encryption keys and of original ciphertexts which he manipulate is highly desirable. We first f...
متن کاملProvably Secure Certificate-based Conditional Proxy Re-encryption
A proxy re-encryption scheme (PRE) allows a semi-trusted proxy to convert a ciphertext encrypted under one key into a ciphertext encrypted under another key without leaking the underlying plaintext. In the process of the arithmetic processing, proxy should be able to learn as little information about the plaintext as possible. Conditional proxy re-encryption (CPRE) is a new cryptography primiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 8 شماره
صفحات -
تاریخ انتشار 2013